Approximation Algorithms for Probabilistic Decoding

نویسندگان

  • Irina Rish
  • Kalev Kask
چکیده

It was recently shown that the problem of decoding messages transmitted through a noisy channel can be formulated as a belief updating task over a probabilistic network [13]. Moreover, it was observed that iterative application of the (linear time) belief propagation algorithm designed for polytrees [14] outperformed state of the art decoding algorithms, even though the corresponding networks may have many cycles. Much of recent research in coding focuses on explaining this phenomenon. This paper demonstrates empirically that an approximation algorithm approx-mpe for solving the most probable explanation (MPE) problem, developed within the recently proposed mini-bucket elimination framework [3], outperforms iterative belief propagation on classes of coding networks that have bounded induced width. Our experiments suggest that decoders based on nding an MPE assignment (block-wise decoding) can be superior to the commonly used belief updating decoders (bit-wise decoders).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding

It was recently shown that the problem of decoding messages transmitted through a noisy channel can be formulated as a belief updating task over a probabilistic network [14]. Moreover, it was observed that iterative application of the (linear time) belief propagation algorithm designed for polytrees [15] outperformed state of the art decoding algorithms, even though the corresponding networks m...

متن کامل

List Decoding of Reed-Muller Codes

We construct list decoding algorithms for first order Reed-Muller codes RM [1,m] of length n = 2m correcting up to n(12 − 2) errors with complexity O(n2−3). Considering probabilistic approximation of these algorithms leads to randomized list decoding algorithms with characteristics similar to Goldreich-Levin algorithm, namely, of complexity O(m22−7 log 12 (log 12 +log 1 Perr +log m)), where Per...

متن کامل

Approximation Methods for Solving the Equitable Location Problem with Probabilistic Customer Behavior

Location-allocation of facilities in service systems is an essential factor of their performance. One of the considerable situations which less addressed in the relevant literature is to balance service among customers in addition to minimize location-allocation costs. This is an important issue, especially in the public sector. Reviewing the recent researches in this field shows that most of t...

متن کامل

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998